Discrete Zak transforms, polyphase transforms, and applications

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete Zak Transforms, Polyphase Transforms, and Applications - Signal Processing, IEEE Transactions on

We consider three different versions of the Zak transform (ZT) for discrete-time signals, namely, the discretetime ZT, the polyphase transform, and a cyclic discrete ZT. In particular, we show that the extension of the discrete-time ZT to the complex z-plane results in the polyphase transform, an important and well-known concept in multirate signal processing and filter bank theory. We discuss ...

متن کامل

Importance of Zak Transforms for Harmonic Analysis

In engineering and applied mathematics, Zak transforms have been effectively used for over 50 years in various applied settings. As Gelfand observed in a 1950 paper, the variable coefficient Fourier series ideas articulated in Andre Weil’s famous book on integration lead to an exceedingly elementary proof of the Plancherel Theorem for LCA groups. The transform for functions on R appearing in Za...

متن کامل

Comparison of Discrete Cosine Transforms (DCT), Discrete Fourier Transforms (DFT), and Discrete Wavelet Transforms (DWT) in Digital Image Watermarking

Digital Image Watermarking is used recently to secure the image by embedding another digital image. It is typically used to identify ownership of the copyright of the signal. Frequency domain transformation methods used widely in Digital Image Compression and Digital Image Watermarking. They reduce the weakness of classics digital image watermarking such as Least Significant Bit (LSB) methods w...

متن کامل

Computation of Convolutions and Discrete Fourier Transforms by Polynomial Transforms

Discrete transforms are introduced and are defined in a ring of polynomials. These polynomial transforms are shown to have the convolution property and can be computed in ordinary arithmetic, without multiplications. Polynomial transforms are particularly well suited for computing discrete two-dimensional convolutions with a minimum number of operations. Efficient algorithms for computing one-d...

متن کامل

Sliding discrete fractional transforms

Fractional transforms are useful tools for processing of non-stationary signals. The methods of implementing sliding discrete fractional Fourier transform (SDFRFT), sliding discrete fractional cosine transform (SDFRCT) and sliding discrete fractional sine transform (SDFRST) for real time processing of signals are presented. The performances of these sliding transforms, with regard to computatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 1997

ISSN: 1053-587X

DOI: 10.1109/78.564174